MatchMaking - A Tool to Match OWL Schemas
نویسندگان
چکیده
This paper describes a software tool that implements an instancebased schema matching technique for OWL dialects. The technique is based on a matching algorithm that depends on the definition of similarity functions that evaluate the semantic proximity of elements from two different schemas. The tool is engineered to accommodate different similarity functions and variations of the matching algorithm, thereby facilitating experimentation with alternative setups.
منابع مشابه
Semantic matchmaking of web services using model checking
Service matchmaking is the process of finding suitable services given by the providers for the service requests of consumers. Previous approaches to service matchmaking is mostly based on matching the input-output parameters of service requests and service provisions. However, such approaches do not capture the semantics of the services and hence cannot match requests to services effectively. T...
متن کاملMatching of Ontologies with XML Schemas Using a Generic Metamodel
Schema matching is the task of automatically computing correspondences between schema elements. A multitude of schema matching approaches exists for various scenarios using syntactic, semantic, or instance information. The schema matching problem is aggravated by the fact that models to be matched are often represented in different modeling languages, e.g. OWL, XML Schema, or SQL DDL. Consequen...
متن کاملCOMA++: Results for the Ontology Alignment Contest OAEI 2006
This paper summarizes the OAEI Contest 2006 results for the matching tool COMA++. The study shows that a generic schema matching system can also effectively solve complex ontology matching tasks. 1 Presentation of the system COMA++ is an extension of our previous COMA prototype [1]. It is a customizable and generic tool for matching both schemas and ontologies specified in languages such as SQL...
متن کاملEvaluating Semantic Web Service Matchmaking Effectiveness Based on Graded Relevance
Semantic web services (SWS) promise to take service oriented computing to a new level by allowing to semi-automate timeconsuming programming tasks. At the core of SWS are solutions to the problem of SWS matchmaking, i.e., the problem of comparing semantic goal descriptions with semantic offer descriptions to determine services able to fulfill a given request. Approaches to this problem have so ...
متن کاملSemantic Web Service Selection Based on Service Provider’s Business Offerings
Semantic Web service discovery finds a match between the service requirement and service advertisements based on the semantic descriptions. The matchmaking mechanism might find semantically similar Web services having same matching score. In this paper, the authors propose the semantic Web service selection mechanism which distinguishes semantically similar Web services based on the Quality of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- RITA
دوره 16 شماره
صفحات -
تاریخ انتشار 2009